0.07/0.12 % Problem : SLH414^1 : TPTP v7.5.0. Released v7.5.0. 0.07/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n005.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 30 0.13/0.34 % WCLimit : 30 0.13/0.34 % DateTime : Tue Aug 9 02:56:34 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.47 The problem SPC is TH0_THM_EQU_NAR 0.19/0.47 Running higher-order on 1 cores theorem proving 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.47 # Version: 3.0pre003-ho 0.19/0.51 # Preprocessing class: HSLSSMSSSSSCHFA. 0.19/0.51 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.19/0.51 # Starting lpo8_lambda_fix with 30s (1) cores 0.19/0.51 # lpo8_lambda_fix with pid 29293 completed with status 0 0.19/0.51 # Result found by lpo8_lambda_fix 0.19/0.51 # Preprocessing class: HSLSSMSSSSSCHFA. 0.19/0.51 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.19/0.51 # Starting lpo8_lambda_fix with 30s (1) cores 0.19/0.51 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0) 0.19/0.51 # ...ProofStateSinE()=154/228 0.19/0.51 # Search class: HGHSM-FSLS32-MHFFFSBN 0.19/0.51 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.19/0.51 # Starting sh3 with 17s (1) cores 0.19/0.51 # sh3 with pid 29295 completed with status 0 0.19/0.51 # Result found by sh3 0.19/0.51 # Preprocessing class: HSLSSMSSSSSCHFA. 0.19/0.51 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.19/0.51 # Starting lpo8_lambda_fix with 30s (1) cores 0.19/0.51 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0) 0.19/0.51 # ...ProofStateSinE()=154/228 0.19/0.51 # Search class: HGHSM-FSLS32-MHFFFSBN 0.19/0.51 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.19/0.51 # Starting sh3 with 17s (1) cores 0.19/0.51 # Preprocessing time : 0.005 s 0.19/0.51 # Presaturation interreduction done 0.19/0.51 0.19/0.51 # Proof found! 0.19/0.51 # SZS status ContradictoryAxioms 0.19/0.51 # SZS output start CNFRefutation 0.19/0.51 thf(decl_22, type, minus_1649712171iset_a: multiset_a > multiset_a > multiset_a). 0.19/0.51 thf(decl_23, type, plus_plus_multiset_a: multiset_a > multiset_a > multiset_a). 0.19/0.51 thf(decl_24, type, zero_zero_multiset_a: multiset_a). 0.19/0.51 thf(decl_25, type, nO_MAT1617603563iset_a: multiset_a > multiset_a > $o). 0.19/0.51 thf(decl_26, type, heapIm1140443833left_a: tree_a > tree_a). 0.19/0.51 thf(decl_27, type, heapIm1257206334ight_a: tree_a > tree_a). 0.19/0.51 thf(decl_28, type, heapIm1091024090Down_a: tree_a > tree_a). 0.19/0.51 thf(decl_29, type, e_a: tree_a). 0.19/0.51 thf(decl_30, type, t_a: a > tree_a > tree_a > tree_a). 0.19/0.51 thf(decl_31, type, pred_Tree_a: (a > $o) > tree_a > $o). 0.19/0.51 thf(decl_32, type, in_tree_a: a > tree_a > $o). 0.19/0.51 thf(decl_33, type, is_heap_a: tree_a > $o). 0.19/0.51 thf(decl_34, type, multiset_a2: tree_a > multiset_a). 0.19/0.51 thf(decl_35, type, val_a: tree_a > a). 0.19/0.51 thf(decl_36, type, lattic146396397_Max_a: set_a > a). 0.19/0.51 thf(decl_37, type, add_mset_a: a > multiset_a > multiset_a). 0.19/0.51 thf(decl_38, type, comm_m315775925iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.19/0.51 thf(decl_39, type, fold_m382157835iset_a: (multiset_a > multiset_a > multiset_a) > multiset_a > multiset_multiset_a > multiset_a). 0.19/0.51 thf(decl_40, type, fold_m364285649iset_a: (a > multiset_a > multiset_a) > multiset_a > multiset_a > multiset_a). 0.19/0.51 thf(decl_41, type, is_empty_a: multiset_a > $o). 0.19/0.51 thf(decl_42, type, mult1_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.19/0.51 thf(decl_43, type, mult_a: set_Product_prod_a_a > set_Pr158363655iset_a). 0.19/0.51 thf(decl_44, type, set_mset_multiset_a: multiset_multiset_a > set_multiset_a). 0.19/0.51 thf(decl_45, type, set_mset_a: multiset_a > set_a). 0.19/0.51 thf(decl_46, type, ord_less_eq_o_o_a: ($o > $o > a) > ($o > $o > a) > $o). 0.19/0.51 thf(decl_47, type, ord_less_eq_o_a: ($o > a) > ($o > a) > $o). 0.19/0.51 thf(decl_48, type, ord_less_eq_Tree_a_o: (tree_a > $o) > (tree_a > $o) > $o). 0.19/0.51 thf(decl_49, type, ord_less_eq_a_o: (a > $o) > (a > $o) > $o). 0.19/0.51 thf(decl_50, type, ord_le1199012836iset_a: multiset_a > multiset_a > $o). 0.19/0.51 thf(decl_51, type, ord_less_eq_a: a > a > $o). 0.19/0.51 thf(decl_52, type, order_Greatest_o_a: (($o > a) > $o) > $o > a). 0.19/0.51 thf(decl_53, type, order_Greatest_a: (a > $o) > a). 0.19/0.51 thf(decl_54, type, produc2037245207iset_a: multiset_a > multiset_a > produc1127127335iset_a). 0.19/0.51 thf(decl_55, type, product_Pair_a_a: a > a > product_prod_a_a). 0.19/0.51 thf(decl_56, type, irrefl_a: set_Product_prod_a_a > $o). 0.19/0.51 thf(decl_57, type, trans_a: set_Product_prod_a_a > $o). 0.19/0.51 thf(decl_58, type, collect_a: (a > $o) > set_a). 0.19/0.51 thf(decl_59, type, member_multiset_a: multiset_a > set_multiset_a > $o). 0.19/0.51 thf(decl_60, type, member340150864iset_a: produc1127127335iset_a > set_Pr158363655iset_a > $o). 0.19/0.51 thf(decl_61, type, member449909584od_a_a: product_prod_a_a > set_Product_prod_a_a > $o). 0.19/0.51 thf(decl_62, type, member_a: a > set_a > $o). 0.19/0.51 thf(decl_63, type, t: tree_a). 0.19/0.51 thf(decl_64, type, esk1_1: tree_a > a). 0.19/0.51 thf(decl_65, type, esk2_1: tree_a > a). 0.19/0.51 thf(decl_66, type, esk3_1: tree_a > a). 0.19/0.51 thf(decl_67, type, esk4_1: tree_a > tree_a). 0.19/0.51 thf(decl_68, type, esk5_1: tree_a > tree_a). 0.19/0.51 thf(decl_69, type, esk6_1: tree_a > a). 0.19/0.51 thf(decl_70, type, esk7_1: tree_a > a). 0.19/0.51 thf(decl_71, type, esk8_1: tree_a > tree_a). 0.19/0.51 thf(decl_72, type, esk9_1: tree_a > tree_a). 0.19/0.51 thf(decl_73, type, esk10_1: tree_a > a). 0.19/0.51 thf(decl_74, type, esk11_1: tree_a > a). 0.19/0.51 thf(decl_75, type, esk12_1: tree_a > tree_a). 0.19/0.51 thf(decl_76, type, esk13_1: tree_a > tree_a). 0.19/0.51 thf(decl_77, type, esk14_1: tree_a > a). 0.19/0.51 thf(decl_78, type, esk15_1: tree_a > tree_a). 0.19/0.51 thf(decl_79, type, esk16_1: tree_a > tree_a). 0.19/0.51 thf(decl_80, type, esk17_1: tree_a > a). 0.19/0.51 thf(decl_81, type, esk18_1: tree_a > a). 0.19/0.51 thf(decl_82, type, esk19_1: tree_a > a). 0.19/0.51 thf(decl_83, type, esk20_1: tree_a > tree_a). 0.19/0.51 thf(decl_84, type, esk21_1: tree_a > tree_a). 0.19/0.51 thf(decl_85, type, esk22_1: tree_a > a). 0.19/0.51 thf(decl_86, type, esk23_1: tree_a > a). 0.19/0.51 thf(decl_87, type, esk24_1: tree_a > tree_a). 0.19/0.51 thf(decl_88, type, esk25_1: tree_a > tree_a). 0.19/0.51 thf(decl_89, type, esk26_1: tree_a > a). 0.19/0.51 thf(decl_90, type, esk27_1: tree_a > a). 0.19/0.51 thf(decl_91, type, esk28_1: tree_a > tree_a). 0.19/0.51 thf(decl_92, type, esk29_1: tree_a > tree_a). 0.19/0.51 thf(decl_93, type, esk30_1: tree_a > a). 0.19/0.51 thf(decl_94, type, esk31_1: tree_a > tree_a). 0.19/0.51 thf(decl_95, type, esk32_1: tree_a > tree_a). 0.19/0.51 thf(decl_96, type, esk33_1: tree_a > a). 0.19/0.51 thf(decl_97, type, esk34_1: tree_a > tree_a). 0.19/0.51 thf(decl_98, type, esk35_1: tree_a > tree_a). 0.19/0.51 thf(decl_99, type, esk36_1: (tree_a > $o) > a). 0.19/0.51 thf(decl_100, type, esk37_1: (tree_a > $o) > tree_a). 0.19/0.51 thf(decl_101, type, esk38_1: (tree_a > $o) > tree_a). 0.19/0.51 thf(decl_102, type, esk39_2: tree_a > a > tree_a). 0.19/0.51 thf(decl_103, type, esk40_2: tree_a > a > a). 0.19/0.51 thf(decl_104, type, esk41_2: tree_a > a > tree_a). 0.19/0.51 thf(decl_105, type, epred1_2: ($o > a) > ($o > a) > $o). 0.19/0.51 thf(decl_106, type, epred2_2: ($o > a) > ($o > a) > $o). 0.19/0.51 thf(decl_107, type, esk42_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_108, type, esk43_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_109, type, esk44_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.51 thf(decl_110, type, esk45_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.51 thf(decl_111, type, esk46_4: a > (a > a) > a > a > a). 0.19/0.51 thf(decl_112, type, esk47_4: a > (a > a) > a > a > a). 0.19/0.51 thf(decl_113, type, esk48_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.51 thf(decl_114, type, esk49_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.51 thf(decl_115, type, esk50_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.51 thf(decl_116, type, esk51_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.51 thf(decl_117, type, esk52_4: a > a > (a > a) > a > a). 0.19/0.51 thf(decl_118, type, esk53_4: a > a > (a > a) > a > a). 0.19/0.51 thf(decl_119, type, esk54_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.51 thf(decl_120, type, esk55_4: ($o > a) > (a > $o > a) > a > a > a). 0.19/0.51 thf(decl_121, type, esk56_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_122, type, esk57_4: a > (($o > a) > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_123, type, esk58_4: a > (a > a) > a > a > a). 0.19/0.51 thf(decl_124, type, esk59_4: a > (a > a) > a > a > a). 0.19/0.51 thf(decl_125, type, esk60_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.51 thf(decl_126, type, esk61_4: a > a > (a > $o > a) > ($o > a) > a). 0.19/0.51 thf(decl_127, type, esk62_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.51 thf(decl_128, type, esk63_4: ($o > a) > ($o > a) > (($o > a) > a) > a > $o > a). 0.19/0.51 thf(decl_129, type, esk64_4: a > a > (a > a) > a > a). 0.19/0.51 thf(decl_130, type, esk65_4: a > a > (a > a) > a > a). 0.19/0.51 thf(decl_131, type, esk66_1: (a > a > $o) > a). 0.19/0.51 thf(decl_132, type, esk67_1: (a > a > $o) > a). 0.19/0.51 thf(decl_133, type, esk68_1: (a > a > $o) > a). 0.19/0.51 thf(decl_134, type, esk69_1: (a > a > $o) > a). 0.19/0.51 thf(decl_135, type, esk70_1: (multiset_a > $o) > a). 0.19/0.51 thf(decl_136, type, esk71_1: (multiset_a > $o) > multiset_a). 0.19/0.51 thf(decl_137, type, esk72_1: (multiset_a > $o) > a). 0.19/0.51 thf(decl_138, type, esk73_1: (multiset_a > $o) > multiset_a). 0.19/0.51 thf(decl_139, type, esk74_1: multiset_a > a). 0.19/0.51 thf(decl_140, type, esk75_1: multiset_a > multiset_a). 0.19/0.51 thf(decl_141, type, esk76_1: (multiset_a > $o) > a). 0.19/0.51 thf(decl_142, type, esk77_1: (multiset_a > $o) > multiset_a). 0.19/0.51 thf(decl_143, type, esk78_1: (multiset_a > multiset_a > $o) > a). 0.19/0.51 thf(decl_144, type, esk79_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.51 thf(decl_145, type, esk80_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.51 thf(decl_146, type, esk81_1: (multiset_a > multiset_a > $o) > a). 0.19/0.51 thf(decl_147, type, esk82_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.51 thf(decl_148, type, esk83_1: (multiset_a > multiset_a > $o) > multiset_a). 0.19/0.51 thf(decl_149, type, esk84_1: multiset_a > multiset_a). 0.19/0.51 thf(decl_150, type, esk85_1: multiset_a > a). 0.19/0.51 thf(decl_151, type, esk86_1: multiset_a > a). 0.19/0.51 thf(decl_152, type, esk87_2: a > multiset_a > multiset_a). 0.19/0.51 thf(decl_153, type, esk88_2: a > multiset_a > multiset_a). 0.19/0.51 thf(decl_154, type, esk89_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.19/0.51 thf(decl_155, type, esk90_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.51 thf(decl_156, type, esk91_3: multiset_a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.51 thf(decl_157, type, esk92_6: multiset_a > a > multiset_a > multiset_a > multiset_a > set_Product_prod_a_a > a). 0.19/0.51 thf(decl_158, type, esk93_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.51 thf(decl_159, type, esk94_4: multiset_a > a > multiset_a > set_Product_prod_a_a > multiset_a). 0.19/0.51 thf(decl_160, type, esk95_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_161, type, esk96_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_162, type, esk97_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_163, type, esk98_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_164, type, esk99_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_165, type, esk100_4: ($o > a) > (($o > a) > $o > a) > ($o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_166, type, esk101_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_167, type, esk102_4: ($o > a) > ($o > a) > (($o > a) > $o > a) > ($o > a) > $o > a). 0.19/0.51 thf(decl_168, type, esk103_4: a > multiset_a > a > multiset_a > multiset_a). 0.19/0.51 thf(decl_169, type, esk104_3: multiset_a > multiset_a > set_Product_prod_a_a > a). 0.19/0.51 thf(decl_170, type, esk105_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.19/0.51 thf(decl_171, type, esk106_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.19/0.51 thf(decl_172, type, esk107_3: set_Product_prod_a_a > multiset_a > multiset_a > multiset_a). 0.19/0.51 thf(decl_173, type, esk108_4: set_Product_prod_a_a > multiset_a > multiset_a > a > a). 0.19/0.51 thf(conj_0, hypothesis, ((e_a)!=(e_a)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.19/0.51 thf(c_0_1, hypothesis, ((e_a)!=(e_a)), inference(split_conjunct,[status(thm)],[conj_0])). 0.19/0.51 thf(c_0_2, hypothesis, ($false), inference(cn,[status(thm)],[c_0_1]), ['proof']). 0.19/0.51 # SZS output end CNFRefutation 0.19/0.51 # Parsed axioms : 228 0.19/0.51 # Removed by relevancy pruning/SinE : 74 0.19/0.51 # Initial clauses : 350 0.19/0.51 # Removed in clause preprocessing : 20 0.19/0.51 # Initial clauses in saturation : 330 0.19/0.51 # Processed clauses : 1 0.19/0.51 # ...of these trivial : 0 0.19/0.51 # ...subsumed : 0 0.19/0.51 # ...remaining for further processing : 0 0.19/0.51 # Other redundant clauses eliminated : 0 0.19/0.51 # Clauses deleted for lack of memory : 0 0.19/0.51 # Backward-subsumed : 0 0.19/0.51 # Backward-rewritten : 0 0.19/0.51 # Generated clauses : 0 0.19/0.51 # ...of the previous two non-redundant : 0 0.19/0.51 # ...aggressively subsumed : 0 0.19/0.51 # Contextual simplify-reflections : 0 0.19/0.51 # Paramodulations : 0 0.19/0.51 # Factorizations : 0 0.19/0.51 # NegExts : 0 0.19/0.51 # Equation resolutions : 0 0.19/0.51 # Propositional unsat checks : 0 0.19/0.51 # Propositional check models : 0 0.19/0.51 # Propositional check unsatisfiable : 0 0.19/0.51 # Propositional clauses : 0 0.19/0.51 # Propositional clauses after purity: 0 0.19/0.51 # Propositional unsat core size : 0 0.19/0.51 # Propositional preprocessing time : 0.000 0.19/0.51 # Propositional encoding time : 0.000 0.19/0.51 # Propositional solver time : 0.000 0.19/0.51 # Success case prop preproc time : 0.000 0.19/0.51 # Success case prop encoding time : 0.000 0.19/0.51 # Success case prop solver time : 0.000 0.19/0.51 # Current number of processed clauses : 0 0.19/0.51 # Positive orientable unit clauses : 0 0.19/0.51 # Positive unorientable unit clauses: 0 0.19/0.51 # Negative unit clauses : 0 0.19/0.51 # Non-unit-clauses : 0 0.19/0.51 # Current number of unprocessed clauses: 329 0.19/0.51 # ...number of literals in the above : 977 0.19/0.51 # Current number of archived formulas : 0 0.19/0.51 # Current number of archived clauses : 0 0.19/0.51 # Clause-clause subsumption calls (NU) : 0 0.19/0.51 # Rec. Clause-clause subsumption calls : 0 0.19/0.51 # Non-unit clause-clause subsumptions : 0 0.19/0.51 # Unit Clause-clause subsumption calls : 0 0.19/0.51 # Rewrite failures with RHS unbound : 0 0.19/0.51 # BW rewrite match attempts : 0 0.19/0.51 # BW rewrite match successes : 0 0.19/0.51 # Condensation attempts : 0 0.19/0.51 # Condensation successes : 0 0.19/0.51 # Termbank termtop insertions : 24648 0.19/0.51 0.19/0.51 # ------------------------------------------------- 0.19/0.51 # User time : 0.024 s 0.19/0.51 # System time : 0.005 s 0.19/0.51 # Total time : 0.028 s 0.19/0.51 # Maximum resident set size: 3580 pages 0.19/0.51 0.19/0.51 # ------------------------------------------------- 0.19/0.51 # User time : 0.032 s 0.19/0.51 # System time : 0.007 s 0.19/0.51 # Total time : 0.039 s 0.19/0.51 # Maximum resident set size: 2148 pages 0.19/0.51 EOF